Autoreferential semantics for many-valued modal logics

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Autoreferential semantics for many-valued modal logics

In this paper we consider the class of truth-functional modal many-valued logics with the complete lattice of truth-values. The conjunction and disjunction logic operators correspond to the meet and join operators of the lattices, while the negation is independently introduced as a hierarchy of antitonic operators which invert bottom and top elements. The non-constructive logic implication will...

متن کامل

Many-valued modal logics

Two families of many-valued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite many-valued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds also to be many-valued. Gentzen sequent calculi are given for both versions, and soundness and compl...

متن کامل

Many-Valued Modal Logics II

Suppose there are several experts, with some dominating others (expert A dominates expert B if B says something is true whenever A says it is). Suppose, further, that each of the experts has his or her own view of what is possible — in other words each of the experts has their own Kripke model in mind (subject, of course, to the dominance relation that may hold between experts). How will they a...

متن کامل

Institutional semantics for many-valued logics

We develop many-valued logic, including a generic abstract model theory, over a fully abstract syntax. We show that important many-valued logic model theories, such as traditional first-order many-valued logic and fuzzy multi-algebras, may be conservatively embedded into our abstract framework. Our development is technically based upon the so-called theory of institutions of Goguen and Burstall...

متن کامل

Dyadic semantics for many-valued logics

This paper obtains an effective method which assigns two-valued semantics to every finite-valued truth-functional logic (in the direction of the so-called “Suszko’s Thesis”), provided that its truth-values can be individualized by means of its linguistic resources. Such two-valued semantics permit us to obtain new tableau proof systems for a wide class of finitevalued logics, including the main...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Non-Classical Logics

سال: 2008

ISSN: 1166-3081,1958-5780

DOI: 10.3166/jancl.18.79-125